A New Method of Reducing Pair-wise Combinatorial Test Suite
نویسندگان
چکیده
منابع مشابه
A New Method of Reducing Pair-wise Combinatorial Test Suite
The biggest problem for combinatorial test is a numerous number of combinations of input parameters by combinatorial explosion. Pair-wise combinatorial coverage testing is an effective method which can reduce the test cases in a suite and is able to detect about 70% program errors. But, under many circumstances, the parameters in programs under test (PUTs) have relations with each other. So the...
متن کاملA Prioritized Test Generation Method for Pair-wise Testing
The most sufficient test methods are based on a test case set which covers all combinations of parameters. However, the scale of test cases is always too large and their cost cannot be accepted. People will first consider the implementation of critical test cases. Even if the test is terminated suddenly, the test cases of high importance will have been executed. It improves the testing efficien...
متن کاملA Test Suite for Combinatorial Auctions
Many researchers have proposed algorithms for determining the winners of general combinatorial auctions, with encouraging results. (Some of these algorithms are described in Chapter 14 of this book.) This line of research has given rise to another problem, however. In order to evaluate—and thus to improve—such algorithms, it is necessary to use some sort of test data. Unfortunately, there is li...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Generating Small Combinatorial Test Suite via LP
Generating a set of combinatorial test cases for web application and development is very important. Linear programming (LP) is one of approaches to generating small combinatorial test suite. But, for software under test (SUT), the number of combinatorial test cases is often extremely large. If using LP to optimize test suite, the optimizing efficiency is low for the enormous size of LP variable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer and Information Science
سال: 2010
ISSN: 1913-8997,1913-8989
DOI: 10.5539/cis.v3n1p35